Water Cycle Algorithm for Attribute Reduction Problems in Rough Set Theory
نویسندگان
چکیده
The attribute reduction is known as the procedure for decreasing the number of features in an information system and its action is a vital phase of data mining processing. In the attribute reduction process, the least subset of attributes is selected (according to rough set theory which is employed as a mathematical tool) from the initial set of attributes with very little loss in information. In this study, a new optimization approach, known as the water cycle algorithm (WCA), has been used for attribute reduction and the rough set theory is employed as a mathematical tool to assess quality of solutions that are produced. The idea of the WC as an optimization algorithm was derived from nature, after examining the whole water cycle process which involves the flow of streams and rivers into the sea in the natural world. The WC-RSAR has been employed in public datasets that are obtainable in UCI. From the findings of the experiments, it has been shown that the suggested method performs equally well or even better than other methods of attribute selection.
منابع مشابه
An Improved Heuristic Attribute Reduction Algorithm Based on Informa- tion Entropy in Rough Set
At present, in rough set theory there are two kinds of heuristic attribute reduction algorithms, one is based on discernibility matrix, the other is based on mutual information. But if these algorithms are applied to the non-core information system, there will be much problems, such as too much calculation, excessive reduction, or insufficient reduction. So we propose an improved heuristic attr...
متن کاملReduction of DEA-Performance Factors Using Rough Set Theory: An Application of Companies in the Iranian Stock Exchange
he financial management field has witnessed significant developments in recent years to help decision makers, managers and investors, to made optimal decisions. In this regard, the institutions investment strategies and their evaluation methods continuously change with the rapid transfer of information and access to the fi- nancial data. When information is available ...
متن کاملAn Attribute Reduction Algorithm Based on Rough Set Theory and an Improved Genetic Algorithm
Because the existing attribute reduction algorithms based on rough set theory and genetic algorithm have the main problems: the complexity in calculating fitness function and slow speed in convergence. An attribute reduction algorithm based on rough set theory and an improved genetic algorithm is proposed in this paper. In order to simplify the calculation of fitness function under the conditio...
متن کاملFPGA Implementation of a Reduct Generation Algorithm based on Rough Set Theory
Rough Set theory, proposed by Pawlak in 1982, is a mathematical tool for classification and analysis of imprecise, uncertain, incomplete or vague information and knowledge. Using various concepts in RST, classification of objects in various classes is done by removing irrelevant and redundant data by using attribute reduction algorithm. Attribute reduction using Rough set theory is one of the k...
متن کاملReducing Attributes in Rough Set Theory with the Viewpoint of Mining Frequent Patterns
The main objective of the Attribute Reduction problem in Rough Set Theory is to find and retain the set of attributes whose values vary most between objects in an Information System or Decision System. Besides, Mining Frequent Patterns aims finding items that the number of times they appear together in transactions exceeds a given threshold as much as possible. Therefore, the two problems have ...
متن کامل